An Operational Semantics of Graph Transformation Systems Using Symmetric Nets
نویسندگان
چکیده
منابع مشابه
An enhanced operational semantics for PEPA nets
The PEPA nets language [GHR02] is a modelling formalism which combines modelling with Petri nets with modelling with stochastic process algebras (SPAs). The SPA used in PEPA nets is Hillston’s PEPA [Hil96]. A PEPA net is built from a collection of PEPA component definitions, a list of labelled arcs in the net, and an initial marking. The tokens of the net are PEPA components. PEPA components en...
متن کاملOperational Equivalence of Graph Transformation Systems
Graph transformation systems (GTS) provide an important theory for numerous applications. With the growing number of GTSbased applications the comparison of operational equivalence of two GTS becomes an important area of research. This work introduces a notion of operational equivalence for graph transformation systems. The embedding of GTS in constraint handling rules (CHR) provides the basis ...
متن کاملGraph Grammars and Operational Semantics
Transformations of graphlike expressions are called correct if they preserve a given functional semantics of the expressions. Combining the algebraic theories of graph grammars (cf. [lo]) and programming language semantics (cf. [l]) it will be proved that the correctness of transformation rules carries over to the correctness of derivations via such rules. Applying this result to LISP we show t...
متن کاملUnfolding semantics of graph transformation
Several attempts have been made of extending to graph grammars the unfolding semantics originally developed by Winskel for (safe) Petri nets, but only partial results were obtained. In this paper we fully extend Winskel’s approach to single-pushout grammars providing them with a categorical concurrent semantics expressed as a coreflection between the category of (semi-weighted) graph grammars a...
متن کاملConstructing Type Systems over an Operational Semantics
Type theories in the sense of Martin-Lof and the NuPRL system are based on taking as primitive a type-free programming language given by an operational semantics, and defining types as partial equivalence relations on the set of closed terms . The construction of a type system is based on a general form of inductive definition that may either be taken as acceptable in its own right, or further ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.303.8